//
// Created by Administrator on 2024/3/26.
//
#include<bits/stdc++.h>

using namespace std;
typedef long long ll;
#define endl '\n'
int n;
int book[21];
int a[21];
int dp[20 * 500 + 500];
int target;

void dfs(int k) {
    if (dp[target])return;
    if (k >= n) {
        int s = 0;
        for (int i = 0; i < n; i++) {
            if (book[i]) {
                s += a[i];
            }
        }
        dp[s] = 1;
        return;
    }
    book[k] = 0;
    dfs(k + 1);
    book[k] = 1;
    dfs(k + 1);
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);

    while (cin >> n) {
        memset(dp, 0, sizeof(dp));
        target = 0;
        for (int i = 0; i < n; i++) {
            cin >> a[i];
            target += a[i];
        }
        if (target & 1) {
            cout << "Sorry,I can't!" << endl;
            continue;
        }
        target >>= 1;
        dfs(0);
        if (dp[target]) {
            cout << "Of course,I can!" << endl;
        } else {
            cout << "Sorry,I can't!" << endl;
        }

    }
    return 0;
}